Multiple Traveling Salesman Problems Using the Fuzzy c-means Clustering
نویسندگان
چکیده
منابع مشابه
Bilateral Weighted Fuzzy C-Means Clustering
Nowadays, the Fuzzy C-Means method has become one of the most popular clustering methods based on minimization of a criterion function. However, the performance of this clustering algorithm may be significantly degraded in the presence of noise. This paper presents a robust clustering algorithm called Bilateral Weighted Fuzzy CMeans (BWFCM). We used a new objective function that uses some k...
متن کاملUsing Fuzzy Evolutionary Programming to Solve Traveling Salesman Problems
In this paper we present an efficient decomposition technique to speed up evolutionary algorithms when dealing with large scale optimization problems. Divide and conquer methods aim to solving problems in smaller entities and then combining the sub-solutions to form complete solutions. Often the optimal way to divide the problem varies as the evolutionary algorithm proceeds, thus making a stati...
متن کاملLane Detection using Fuzzy C-Means Clustering
In general, road lane detection from a traffic surveillance camera is done by the analysis of geometric shapes of the road. Thus, Hough transform or B-snake technology is preferred to intelligent pattern matching or machine learning such as neural network. However, we insist that the feasibility of using intelligent technique in this area is quite undervalued. In this paper, we first divide the...
متن کاملOPTIMIZATION OF FUZZY CLUSTERING CRITERIA BY A HYBRID PSO AND FUZZY C-MEANS CLUSTERING ALGORITHM
This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...
متن کاملSolving Traveling Salesman Problems Using Molecular Programming
Molecular programming (MP) has been proposed as an evolutionary computation algorithm at the molecular level [Zhang and Shin, 1998]. MP are different from other evolutionary algorithms in its representation of solutions using DNA molecular structures and its use of bio-lab techniques for recombination of partial solutions. In this paper, molecular programming is applied to traveling salesman pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems
سال: 2001
ISSN: 0915-647X,2432-9932
DOI: 10.3156/jfuzzy.13.1_119